Capturing topology in graph pattern matching

Capturing Topology in Graph Pattern Matching

Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead. These extensions allow pattern matching to be conducted in cubic-time. However, they fall short of capturing the topology of data graphs, i.e., graphs may have a structure drastically different from patter...

A Strong Simulation: Capturing Topology in Graph Pattern Matching

Graph pattern matching is to find all matches in a data graph for a given pattern graph, and it is often defined in terms of subgraph isomorphism, an NP-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead. These extensions allow graph pattern matching to be conducted in cubic-time. However, they fall short of capturing the topology of d...

Topology Preserving Graph Matching

We describe an algorithm for graph matching which preserves global topological structure using an homology preserving graph matching. We show that for simplicial homology, graph matching is equivalent to finding an optimal simplicial chain map, which can be posed as a linear program satisfying boundary commutativity, simplex face intersection and assignment constraints. The homology preserving ...

Generalized Graph Pattern Matching

Graphs are high expressive models and especially suitable for modelling highly complex structures, the number of applications that use them for modelling both their data and the processes that manipulate has grown dramatically in recent years. The use of new conceptual structures in real-world applications requires the development of new systems to store and query such structures in order to al...

Incremental Graph Pattern Matching